Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
Identifieur interne : 000830 ( Main/Exploration ); précédent : 000829; suivant : 000831Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
Auteurs : Gérard Huet [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2009.
Abstract
Abstract: We discuss the mathematical structure of various levels of representation of Sanskrit text in order to guide the design of computer aids aiming at useful processing of the digitalised Sanskrit corpus. Two main levels are identified, respectively called the linear and functional level. The design space of these two levels is sketched, and the computational implications of the main design choices are discussed. Current solutions to the problems of mechanical segmentation, tagging, and parsing of Sanskrit text are briefly surveyed in this light. An analysis of the requirements of relevant linguistic resources is provided, in view of justifying standards allowing inter-operability of computer tools. This paper does not attempt to provide definitive solutions to the representation of Sanskrit at the various levels. It should rather be considered as a survey of various choices, allowing an open discussion of such issues in a formally precise general framework.
Url:
DOI: 10.1007/978-3-642-00155-0_6
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000681
- to stream Istex, to step Curation: 000673
- to stream Istex, to step Checkpoint: 000352
- to stream Main, to step Merge: 000838
- to stream Main, to step Curation: 000830
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor</title><author><name sortKey="Huet, Gerard" sort="Huet, Gerard" uniqKey="Huet G" first="Gérard" last="Huet">Gérard Huet</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F0182F346F74AE86190F64F70588F0060134979E</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-00155-0_6</idno><idno type="url">https://api.istex.fr/document/F0182F346F74AE86190F64F70588F0060134979E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000681</idno><idno type="wicri:Area/Istex/Curation">000673</idno><idno type="wicri:Area/Istex/Checkpoint">000352</idno><idno type="wicri:doubleKey">0302-9743:2009:Huet G:formal:structure:of</idno><idno type="wicri:Area/Main/Merge">000838</idno><idno type="wicri:Area/Main/Curation">000830</idno><idno type="wicri:Area/Main/Exploration">000830</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor</title><author><name sortKey="Huet, Gerard" sort="Huet, Gerard" uniqKey="Huet G" first="Gérard" last="Huet">Gérard Huet</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>INRIA Rocquencourt, BP 105, 78153, Le Chesnay Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Île-de-France</region><settlement type="city">Le Chesnay</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2009</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">F0182F346F74AE86190F64F70588F0060134979E</idno><idno type="DOI">10.1007/978-3-642-00155-0_6</idno><idno type="ChapterID">6</idno><idno type="ChapterID">Chap6</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We discuss the mathematical structure of various levels of representation of Sanskrit text in order to guide the design of computer aids aiming at useful processing of the digitalised Sanskrit corpus. Two main levels are identified, respectively called the linear and functional level. The design space of these two levels is sketched, and the computational implications of the main design choices are discussed. Current solutions to the problems of mechanical segmentation, tagging, and parsing of Sanskrit text are briefly surveyed in this light. An analysis of the requirements of relevant linguistic resources is provided, in view of justifying standards allowing inter-operability of computer tools. This paper does not attempt to provide definitive solutions to the representation of Sanskrit at the various levels. It should rather be considered as a survey of various choices, allowing an open discussion of such issues in a formally precise general framework.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Île-de-France</li></region><settlement><li>Le Chesnay</li></settlement></list><tree><country name="France"><region name="Île-de-France"><name sortKey="Huet, Gerard" sort="Huet, Gerard" uniqKey="Huet G" first="Gérard" last="Huet">Gérard Huet</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000830 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000830 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F0182F346F74AE86190F64F70588F0060134979E
|texte= Formal Structure of Sanskrit Text: Requirements Analysis for a Mechanical Sanskrit Processor
}}
| This area was generated with Dilib version V0.6.32. |  |